Dynamical Borel–Cantelli lemma for recurrence theory
نویسندگان
چکیده
Abstract We study the dynamical Borel–Cantelli lemma for recurrence sets in a measure-preserving system $(X, \mu , T)$ with compatible metric d . prove that under some regularity conditions, $\mu $ -measure of following set $$\begin{align*}R(\psi)= \{x\in X : d(T^n x, x) < \psi(n)\ \text{for infinitely many}\ n\in\mathbb{N} \} \end{align*}$$ obeys zero–full law according to convergence or divergence certain series, where $\psi :\mathbb {N}\to \mathbb {R}^+$ The applications our main theorem include Gauss map, $\beta -transformation and homogeneous self-similar sets.
منابع مشابه
Recurrence for random dynamical systems
This paper is a first step in the study of the recurrence behavior in random dynamical systems and randomly perturbed dynamical systems. In particular we define a concept of quenched and annealed return times for systems generated by the composition of random maps. We moreover prove that for super-polynomially mixing systems, the random recurrence rate is equal to the local dimension of the sta...
متن کاملThe Dynamical Borel-cantelli Lemma for Interval Maps
Abstract. The dynamical Borel-Cantelli lemma for some interval maps is considered. For expanding maps whose derivative has bounded variation, any sequence of intervals satisfies the dynamical Borel-Cantelli lemma. If a map has an indifferent fixed point, then the dynamical Borel-Cantelli lemma does not hold even in the case that the map has a finite absolutely continuous invariant measure and s...
متن کاملA Borel-cantelli Lemma for Nonuniformly Expanding Dynamical Systems
Let (An)n=1 be a sequence of sets in a probability space (X,B, μ) such that P∞ n=1 μ(An) =∞. The classical Borel-Cantelli lemma states that if the sets An are independent, then μ({x ∈ X : x ∈ An for infinitely many values of n}) = 1. We present analogous dynamical Borel-Cantelli lemmas for certain sequences of sets (An) inX (including nested balls) for a class of deterministic dynamical systems...
متن کاملRegular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
Let D(n)(D(n, k)) denote the maximum possible d such that there exists a d-regular hypergraph (d-regular k-uniform hypergraph, respectively) on n vertices containing no proper regular spanning subhypergraph. The problem of estimating D(n) arises in Game Theory and Huckemann and Jurkat were the first to prove that it is finite. Here we give two new simple proofs that D(n), D(n, k) are finite, an...
متن کاملCategory Theory to Yoneda's Lemma
This development proves Yoneda's lemma and aims to be readable by humans. It only defines what is needed for the lemma: categories, func-tors and natural transformations. Limits, adjunctions and other important concepts are not included. There is no explanation or discussion in this document. See [O'K04] for this and a survey of category theory formalisations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2021
ISSN: ['0143-3857', '1469-4417']
DOI: https://doi.org/10.1017/etds.2021.23